NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
271	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
272	Real Time Recovery in Berth Allocation Problem in Bulk Ports Nitish Umang Michel Bierlaire STRC 2012 Add to Reading List Source URL: www.strc.ch Language: English - Date: 2012-05-16 12:57:38 Operations research NP-complete problems Berth allocation problem Berth Optimization problem Mathematical optimization Ship Mathematics Systems science Applied mathematics
273	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
274	SEAProgram Monday, June 29th 8:00 8:50 9:00 Add to Reading List Source URL: sea2015.lip6.fr Language: English - Date: 2015-06-14 11:10:18 NP-complete problems Computational complexity theory Steiner tree problem Combinatorial optimization Shortest path problem Mathematical optimization Independent set Combinatorics Graph theory Book:Graph Theory
275	LNCSA Tutorial on Satisfiability Modulo Theories Add to Reading List Source URL: yices.csl.sri.com Language: English - Date: 2015-12-11 18:43:06 Theoretical computer science Mathematical logic Mathematics Constraint programming Automated theorem proving Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem DPLL algorithm Symbol Conjunctive normal form
276	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:33 NP-complete problems Dominating set Approximation algorithm Domination Connected dominating set Domatic number
277	Creating Across puzzles using Across Lite Copyright Notice This is a copyrighted document owned by Literate Software Systems. Distribution of this document does not confer any rights to any entity other than to enable cr Add to Reading List Source URL: www.litsoft.com Language: English - Date: 2016-01-05 20:29:42 NP-complete problems Leisure Puzzles Computing Logic puzzles Crossword Rebus Newline Text file Microsoft Notepad PUZ
278	Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-26 04:11:59 Graph theory Graph operations NP-complete problems Graph coloring Cograph Clique Matching Pathwidth
279	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
280	Analytical Approach to Parallel Repetition arXiv:1305.1979v2 [cs.CC] 15 May 2013 Irit Dinur∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-16 00:51:18 NP-complete problems Mathematics Generalised Whitehead product Homotopy theory Unique games conjecture

UPDATE